Virtual port channel bounce in overlay network

ABSTRACT

Aspects of the subject disclosure relate to methods for detecting a link failure between the first network device and a destination node, receiving a data packet addressed to the destination node, and rewriting encapsulation information of the first data packet. Subsequent to rewriting the encapsulation information of the first data packet, the first data packet is forwarded to a second network device (e.g., using updated address information in the packet header), wherein the second network device is paired with the first network device in the virtual port channel. In certain aspects, systems and computer readable media are also provided.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No.15/369,696 filed on Dec. 5, 2016, which is a continuation of U.S. patentapplication Ser. No. 14/508,909 filed on Oct. 7, 2014, which is now U.S.Pat. No. 9,544,224, and which claims the benefit of U.S. ProvisionalPatent Application Ser. No. 61/900,333 filed on Nov. 5, 2013, thecontents of which are incorporated by reference in their entireties.

BACKGROUND 1. Field

The subject technology relates to methods and systems for preventingpacket loss and in particular, for avoiding packet loss by bouncingpackets in response to a link failure event detected in a virtual portchannel.

2. Introduction

The soaring demand for network data throughout the globe has steadilyfueled the evolution of networking technologies, as engineers andmanufacturers rush to keep pace with the changing data consumptionlandscape and increasing network scalability requirements. Variousnetwork technologies have been developed to meet the demand for networkdata. For example, overlay network solutions, such as virtual extensiblelocal area networks (VXLANs), as well as virtualization and cloudcomputing technologies, have been widely implemented.

In some network implementations, overlay solutions are used to allowvirtual networks to be created over a physical network infrastructure.Accordingly, overlay networks allow network administrators to expand acurrent physical network infrastructure through the use of virtualnetworks. Overlay networks can also provide logical network isolation,which allow data centers or providers to host a large number ofcustomers (i.e., “tenants”) while providing each customer their ownisolated network domain.

BRIEF DESCRIPTION OF THE DRAWINGS

Certain features of the subject technology are set forth in the appendedclaims. However, the accompanying drawings, which are included toprovide further understanding, illustrate disclosed aspects and togetherwith the description serve to explain the principles of the subjecttechnology. In the drawings:

FIG. 1 illustrates an example network device, according to certainaspects of the subject technology.

FIG. 2 illustrates a schematic block diagram of an example networkfabric, according to some implementations of the subject technology.

FIG. 3 illustrates a schematic diagram of an example overlay network,according to some implementations of the subject technology.

FIG. 4 illustrates an example of an overlay network in which a virtualport channel can be implemented.

FIG. 5 illustrates a block diagram of an example method for respondingto a link failure, according to some implementations of the technology.

DETAILED DESCRIPTION

The detailed description set forth below is intended as a description ofvarious configurations of the subject technology and is not intended torepresent the only configurations in which the subject technology can bepracticed. The appended drawings are incorporated herein and constitutea part of the detailed description. The detailed description includesspecific details for the purpose of providing a more thoroughunderstanding of the subject technology. However, it will be clear andapparent that the subject technology is not limited to the specificdetails set forth herein and may be practiced without these details. Insome instances, structures and components are shown in block diagramform in order to avoid obscuring the concepts of the subject technology.

Overview

A computer network is a geographically distributed collection of nodesinterconnected by communication links and segments for transporting databetween endpoints, such as personal computers and workstations. Manytypes of networks are available, with the types ranging from local areanetworks (LANs) and wide area networks (WANs) to overlay andsoftware-defined networks, such as virtual extensible local areanetworks (VXLANs).

LANs typically connect nodes over dedicated private communication linkslocated in the same geographic region, such as a building or campus.WANs, on the other hand, typically connect geographically dispersednodes over long-distance communications links, such as common carriertelephone lines, optical lightpaths, synchronous optical networks(SONET), or synchronous digital hierarchy (SDH) links. LANs and WANs caninclude layer 2 (L2) and/or layer 3 (L3) networks and devices.

The Internet is an example of a WAN that connects disparate networksthroughout the world, providing global communication between nodes onvarious networks. The nodes typically communicate over the network byexchanging discrete frames or packets of data according to predefinedprotocols, such as the Transmission Control Protocol/Internet Protocol(TCP/IP). In this context, a protocol can refer to a set of rulesdefining how the nodes interact with each other. Computer networks maybe further interconnected by an intermediate network node, such as arouter, to extend the effective “size” of each network.

Overlay networks generally allow virtual networks to be created andlayered over a physical network infrastructure. Overlay networkprotocols, such as Virtual Extensible LAN (VXLAN), NetworkVirtualization using Generic Routing Encapsulation (NVGRE), NetworkVirtualization Overlays (NVO3), and Stateless Transport Tunneling (STT),provide a traffic encapsulation scheme that allows network traffic to becarried across L2 and L3 networks over a logical tunnel. Such logicaltunnels can be originated and terminated through virtual tunnel endpoints (VTEPs).

Moreover, overlay networks can include virtual segments, such as VXLANsegments in a VXLAN overlay network, which can include virtual L2 and/orL3 overlay networks over which VMs communicate. The virtual segments canbe identified through a virtual network identifier (VNID), such as aVXLAN network identifier, which can specifically identify an associatedvirtual segment or domain.

Description

In some overlay implementations, virtual port channels (VPCs) are usedto logically link or combine different network elements, for example,using a shared address. Packets transmitted over a VPC may be directedto an address of the VPC, or specifically addressed to an individual VPCmember switch. In conventional overlay networks utilizing VPCs, linkfailures (e.g., as between one VPC member and a connected node), canresult in significant packet loss for in-transit packets that are sentto a shared address and arrive at a VPC member switch with a brokenlink. That is, during the time required to propagate a link failureevent by a respective switch (e.g., to adjust rerouting addresses),significant packet loss can be incurred for in-transit packets whichcontain outdated address information i.e., relating to an unavailabledestination or way point.

The disclosed technology addresses the foregoing problem by providingmethods and systems to detect a link failure event and to reroutepackets away from a broken link, e.g., by forwarding inbound packets toa VPC partner switch or tunnel end-point (TEP). As will be discussed infurther detail below, methods of the subject technology can beimplemented by detecting a link failure and rewriting encapsulationinformation for inbound packets that cannot be transmitted using theiroriginal address information. Because address information of partnerswitches in a VPC are known by all VPC members, the relevant TEP canquickly rewrite/modify inbound packet encapsulation information(addresses), forwarding inbound traffic to an available VPC partner. Byrewriting packet encapsulation information more quickly than reroutingdecisions can be implemented elsewhere in the network architecture, therewriting TEP can “bounce” packets to a VPC partner switch, withoutrealizing packet loss during the latency period in which re-routingdecisions are propagated throughout the network.

A brief introductory description of example systems and networks, asillustrated in FIGS. 1 through 3, is disclosed herein. FIG. 1illustrates an example network device 110 suitable for implementing thepresent invention. Network device 110 includes a master centralprocessing unit (CPU) 162, interfaces 168, and bus 115 (e.g., a PCIbus). When acting under the control of appropriate software or firmware,CPU 162 is responsible for executing packet management, error detection,and/or routing functions, such as miscabling detection functions, forexample. The CPU 162 can accomplish all these functions under thecontrol of software including an operating system and any appropriateapplications software. CPU 162 may include one or more processors 163such as a processor from the Motorola family of microprocessors or theMIPS family of microprocessors. In alternative aspects, processor 163 isspecially designed hardware for controlling the operations of router110. In a specific implementation, memory 161 (such as non-volatile RAMand/or ROM) also forms part of CPU 162. However, there are manydifferent ways in which memory could be coupled to the system.

Interfaces 168 are typically provided as interface cards (sometimesreferred to as “line cards”). Generally, they control the sending andreceiving of data packets over the network and sometimes support otherperipherals used with router 110. Among the interfaces that may beprovided are Ethernet interfaces, frame relay interfaces, cableinterfaces, DSL interfaces, token ring interfaces, and the like. Inaddition, various very high-speed interfaces may be provided such asfast token ring interfaces, wireless interfaces, Ethernet interfaces,Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POSinterfaces, FDDI interfaces and the like.

Although the system shown in FIG. 1 is one specific network device ofthe present invention, it is not the only network device architecture onwhich aspects of the subject technology can be implemented. For example,an architecture having a single processor that handles communications aswell as routing computations, etc. is often used. Further, other typesof interfaces and media may also be implemented.

FIG. 2 illustrates a schematic block diagram of an example architecture200 for a network fabric 212. Network fabric 212 can include spineswitches 202A, 202B, . . . , 202N (collectively “202”) connected to leafswitches 204A, 204B, 204C, . . . , 204N (collectively “204”) in networkfabric 212.

Spine switches 202 can be L2 switches in fabric 212; that is, spineswitches 202 can be configured to perform L2 functionalities. Further,spine switches 202 can support various capabilities, such as 40 or 10Gbps Ethernet data transfer speeds. In some implementations, one or moreof spine switches 202 can be configured to host a proxy function thatperforms a lookup of the endpoint address identifier to locator mappingin a mapping database on behalf of leaf switches 204 that do not havesuch mapping. The proxy function can do this by parsing through thepacket to the encapsulated tenant packet to get to the destinationlocator address of the tenant. Spine switches 202 can then perform alookup of their local mapping database to determine the correct locatoraddress of the packet and forward the packet to the locator addresswithout changing certain fields in the header of the packet.

When a packet is received at spine switch 202 i, spine switch 202 i canfirst check if the destination locator address is a proxy address. Ifso, spine switch 202 i can perform the proxy function as previouslymentioned. If not, spine switch 202 i can lookup the locator in itsforwarding table and forward the packet accordingly.

Spine switches 202 connect to leaf switches 204 in fabric 212. Leafswitches 204 can include access ports (or non-fabric ports) and fabricports. Fabric ports can provide uplinks to spine switches 202, whileaccess ports can provide connectivity for devices, hosts, endpoints,VMs, or external networks to fabric 212.

Leaf switches 204 can reside at the edge of fabric 212, and can thusrepresent the physical network edge. In some cases, leaf switches 204can be top-of-rack (“ToR”) switches configured according to a ToRarchitecture. In other cases, leaf switches 204 can be aggregationswitches in any particular topology, such as end-of-row (EoR) ormiddle-of-row (MoR) topologies. In some aspects, leaf switches 204 canalso represent aggregation switches, for example.

Leaf switches 204 can be responsible for routing and/or bridging thetenant packets and applying network policies. In some cases, a leafswitch can perform one or more additional functions, such asimplementing a mapping cache, sending packets to the proxy function whenthere is a miss in the cache, encapsulate packets, enforce ingress oregress policies, etc.

Moreover, leaf switches 204 can contain virtual switchingfunctionalities, such as a virtual tunnel endpoint (VTEP) function asexplained below in the discussion of VTEP 308 in FIG. 3. To this end,leaf switches 204 can connect fabric 212 to an overlay network, such asoverlay network 300 illustrated in FIG. 3.

Network connectivity in the fabric 212 can flow through leaf switches204. Here, leaf switches 204 can provide servers, resources, endpoints,external networks, or VMs access to fabric 212, and can connect leafswitches 204 to each other. In some cases, leaf switches 204 can connectEPGs to fabric 212 and/or any external networks. Each EPG can connect tofabric 212 via one of leaf switches 204, for example.

Endpoints 210A-E (collectively “210”) can connect to fabric 212 via leafswitches 204. For example, endpoints 210A and 210B can connect directlyto leaf switch 204A, which can connect endpoints 210A and 210B to fabric212 and/or any other one of leaf switches 204. Similarly, endpoint 210Ecan connect directly to leaf switch 204C, which can connect endpoint210E to fabric 212 and/or any other of leaf switches 204. On the otherhand, endpoints 210C and 210D can connect to leaf switch 204B via L2network 206. Similarly, the wide area network (WAN) can connect to leafswitches 204C or 204D via L2 network 208.

FIG. 3 illustrates an example overlay network 300. Overlay network 300uses an overlay protocol, such as VXLAN, VGRE, VO3, or STT, toencapsulate traffic in L2 and/or L3 packets which can cross overlay L3boundaries in the network. As illustrated in FIG. 3, overlay network 300can include hosts 306A-D interconnected via network 302.

Network 302 can include any packet network, such as an IP network, forexample. Moreover, hosts 306A-D include virtual tunnel end points (VTEP)308A-D, which can be virtual nodes or switches configured to encapsulateand de-encapsulate data traffic according to a specific overlay protocolof the network 300, for the various virtual network identifiers (VNIDs)310A-I. Moreover, hosts 306A-D can include servers containing a virtualtunnel endpoint functionality and virtual workloads. However, in somecases, one or more hosts can also be a physical switch, such as a ToRswitch, configured with a virtual tunnel endpoint functionality. Forexample, hosts 306A and 306B can be physical switches configured with aVTEP. Here, the hosts 306A and 306B can be connected to servers 303A-D,which can include virtual workloads through VMs, for example.

In some embodiments, network 300 can be a VXLAN network, and VTEPs308A-D can be VXLAN tunnel end points. However, as one of ordinary skillin the art will readily recognize, network 300 can represent any type ofoverlay or software-defined network, such as NVGRE, STT, or even overlaytechnologies yet to be invented.

The VNIDs can represent the segregated virtual networks in overlaynetwork 300. Each of the overlay tunnels (VTEPs 308A-D) can include oneor more VNIDs. For example, VTEP 308A can include VNIDs 1 and 2, VTEP308B can include VNIDs 1 and 3, VTEP 308C can include VNIDs 1 and 2, andVTEP 308D can include VNIDs 1-3. As one of ordinary skill in the artwill readily recognize, any particular VTEP can, in other embodiments,have numerous VNIDs, including more than the 3 VNIDs illustrated in FIG.3.

The traffic in overlay network 300 can be segregated logically accordingto specific VNIDs. This way, traffic intended for VNID 1 can be accessedby devices residing in VNID 1, while other devices residing in otherVNIDs (e.g., VNIDs 2 and 3) can be prevented from accessing suchtraffic. In other words, devices or endpoints connected to specificVNIDs can communicate with other devices or endpoints connected to thesame specific VNIDs, while traffic from separate VNIDs can be isolatedto prevent devices or endpoints in other specific VNIDs from accessingtraffic in different VNIDs.

Endpoints and VMs 303A-I can connect to their respective VNID or virtualsegment, and communicate with other endpoints or VMs residing in thesame VNID or virtual segment. For example, endpoint 303A can communicatewith endpoint 303C and VMs 303E and 303G because they all reside in thesame VNID, namely, VNID 1. Similarly, endpoint 303B can communicate withVMs 303F, H because they all reside in VNID 2.

VTEPs 308A-D can encapsulate packets directed at the various VNIDs 1-3in overlay network 300 according to the specific overlay protocolimplemented, such as VXLAN, so traffic can be properly transmitted tothe correct VNID and recipient(s). Moreover, when a switch, router, orother network device receives a packet to be transmitted to a recipientin overlay network 300, it can analyze a routing table, such as a lookuptable, to determine where such packet needs to be transmitted so thetraffic reaches the appropriate recipient. For example, if VTEP 308Areceives a packet from endpoint 303B that is intended for endpoint 303H,VTEP 308A can analyze a routing table that maps the intended endpoint,endpoint 303H, to a specific switch that is configured to handlecommunications intended for endpoint 303H. VTEP 308A might not initiallyknow, when it receives the packet from endpoint 303B, that such packetshould be transmitted to VTEP 308D in order to reach endpoint 303H.Accordingly, by analyzing the routing table, VTEP 308A can lookupendpoint 303H, which is the intended recipient, and determine that thepacket should be transmitted to VTEP 308D, as specified in the routingtable based on endpoint-to-switch mappings or bindings, so the packetcan be transmitted to, and received by, endpoint 303H as expected.

However, continuing with the previous example, in many instances, VTEP308A may analyze the routing table and fail to find any bindings ormappings associated with the intended recipient, e.g., endpoint 303H.Here, the routing table may not yet have learned routing informationregarding endpoint 303H. In this scenario, the VTEP 308A can broadcastor multicast the packet to ensure the proper switch associated withendpoint 303H can receive the packet and further route it to endpoint303H.

FIG. 4 illustrates an example of an overlay network 400 in which avirtual port channel (e.g., virtual port channel 408) can beimplemented. Although overlay network 400 illustrates a full-bipartitetopology, aspects of the technology are not limited to the topologyillustrated in the example of FIG. 4. Rather, it is understood thatimplementations of the technology can be applied to networking systemsthat utilize VPCs in an overlay network, independent of networktopology.

Network 400 includes multiple spines (e.g., spines 402, 404, and 406),as well as multiple TEPs (e.g., leaf S1, S2, S3 and S4). In turn, eachTEP is connected to one or more nodes (e.g., A, C, K, H, M and/or P).Specifically, leaf Si is connected to nodes A and C. Leaf S2 and leaf S3are members of peer-switch S23. As configured, leaf S2 is connected tonode K, and leaf S3 is connected to node M, whereas leaf S2 and leaf S3(as part of peer-switch S23) connected to node H, for example, via VPC408. In this configuration, node K and node M are linked to leaf S2 andleaf S3, irrespective of VPC 408.

In the example of FIG. 4, the connection between spines 402, 404, and406 and each leaf (e.g., leaf S1, leaf S2, leaf S3 and leaf S4), areshown in a full-bipartite graph topology; however, other topologies canbe implemented. As discussed above, leaf S2 and leaf S3 form a virtualpair, e.g., in peer-switch S23. Although peer-switch S23 is shown toinclude leaf S2 and leaf S3, it is understood that a greater number ofswitches may be included, without departing from the scope of theinvention.

In practice, each member of a peer-switch is configured to retainaddress information of each other member switch in the virtual group.Accordingly, in the example of FIG. 4, leaf S2 is pre-configured withthe address information for leaf S3. Likewise, leaf S3 is pre-configuredwith address information for leaf S2. Using pre-configured addressinformation of partner switches within the same peer-switch, a switchconnected to a failed link can be configured to automaticallyforward/redirect incoming packets so that they “bounce” to a partnerswitch.

By way of example, if a link from leaf S3 to node H were to fail,packets transmitted to node H would need to be routed through leaf S2(e.g., to reach node H via the leaf S2-node H link). However, if anincoming packet, for example originating from node A, is sent to node H,(e.g., addressed to VPC 23), there is a possibility that the packetwould arrive at leaf S3. In conventional implementations, if linkfailure detection and address forward information is not updated beforethe packet arrives at leaf S3, the packet is lost, as it cannot betransmitted over the failed VPC link (e.g., from S3 to H).

Implementations of the subject technology avoid the foregoing problem byproviding VPC switches configured to implement a forwarding decisionupon detection of a link fail event in a virtual port channel (such asVPC 408). Further to the above example, leaf S3 can be configured todetect a failed link (e.g., the S3-H link) and in response, forwardincoming packets to the peer-switch, e.g., leaf S2. Thus, a packetreceived by VPC 23, and received by leaf S3, can be forwarded (bounced)to leaf S2 and subsequently transmitted to node H (without beingdropped). In some VPC switches implemented in an overlay network,packets can be forwarded by simply rewriting/changing a destinationaddress in the packet encapsulation information and forwarding thepacket based on the updated encapsulation information.

When implemented in the context of a VPC arrangement, the bouncingmethod of the subject technology provides improved network response tolink failure events, since the nearest network element (e.g., leaf S3)is positioned to most quickly detect a fail event and bounce incomingtraffic to a partner switch.

In some implementations, all paths to a destination node may fail.Further to the above example, the S3-H link may fail concurrently with afailure of the S2-H link. In such instances, a packet bounced from leafS3 (to leaf S2) may be bounced back to leaf S3, e.g., in an endlessloop. To avoid the possibility of endless packet bounce, each VPCpartner switch can be configured so that the forwarding decision isbased on whether or not a received packet was previously bounced.

In certain aspects, the first bounce is indicated by the bouncingswitch, for example, by flipping a bit in the packet encapsulationinformation to indicate the initial packet bounce. Thus, a VPC partnerswitch (e.g., leaf S2) receiving a bounced packet (e.g., from leaf S3),can disregard the bounced packets to avoid problem of an infinitebounce. That is, a VPC switch receiving a packet can determine (1)whether the received packet has already been bounced by a VPC partner,and (2) if the received switch would bounce the packet back to thetransmitting VPC partner. In scenarios where conditions (1) and (2) areboth true, the received packet is discarded to avoid a bouncing loop.

FIG. 5 illustrates a block diagram of an example method 500 forimplementing a VPC packet bounce in an overlay network, according tosome aspects of the technology. Method 500 begins with step 502, inwhich a link failure event is detected, e.g., between a first networkdevice and a destination node. In practice, the first network device isa member switch of a virtual port channel, and is configured withaddress information for the VPC, as well as address information for allother switches in the same VPC.

In step 504 data packet is received by the first network device andaddressed to the destination node. Upon receiving the data packet, andin response to detection of the link failure even in step 502, the firstnetwork device implements a forwarding decision i.e., to bounce thereceived packet to a VPC partner.

In step 506, the forwarding decision is implemented when packetencapsulation information (e.g., a TEP address in the packet header) isre-written/modified to include an address of a VPC partner switch.Subsequently, the packet is forwarded to a VPC partner.

In some implementations, before the packet is forwarded, packetencapsulation information is modified to indicate that the packet hasbeen forwarded (bounced). As discussed in further detail below,previously bounced packets may be discarded by a receiving VPC partnerswitch to avoid the possibility of a forwarding loop.

In step 508, the packet is received at a second network device, which isa VPC partner of the first network device that originally detected thelink fail event. Once the second network device receives the packet,process 500 advances to decision step 510 in which the second networkdevice determines whether the packet was previously bounced.

In practice, the second network device may determine whether a previousbounce occurred by looking at the contents of the packet header. If thepacket header indicates that the received packet was not previouslybounced, then a forwarding decision is implemented at the second networkdevice and the packet is forwarded to its next destination in thenetwork. Alternatively, if in decision step 510 it is determined thatthe received packet was previously bounced, process 500 proceeds to step514, wherein the received packet is discarded so as to avoid aforwarding loop, as between the first network device and the secondnetwork device.

It is understood that any specific order or hierarchy of steps in theprocesses disclosed is an illustration of exemplary approaches. Basedupon design preferences, it is understood that the specific order orhierarchy of steps in the processes may be rearranged, or that only aportion of the illustrated steps be performed. Some of the steps may beperformed simultaneously. For example, in certain circumstances,multitasking and parallel processing may be advantageous. Moreover, theseparation of various system components in the embodiments describedabove should not be understood as requiring such separation in allembodiments, and it should be understood that the described programcomponents and systems can generally be integrated together in a singlesoftware product or packaged into multiple software products.

The previous description is provided to enable any person skilled in theart to practice the various aspects described herein. Variousmodifications to these aspects will be readily apparent to those skilledin the art, and the generic principles defined herein may be applied toother aspects. Thus, the claims are not intended to be limited to theaspects shown herein, but are to be accorded the full scope consistentwith the language claims, wherein reference to an element in thesingular is not intended to mean “one and only one” unless specificallyso stated, but rather “one or more.”

A phrase such as an “aspect” does not imply that such aspect isessential to the subject technology or that such aspect applies to allconfigurations of the subject technology. A disclosure relating to anaspect may apply to all configurations, or one or more configurations. Aphrase such as an aspect cvsn refer to one or more aspects and viceversa. A phrase such as a “configuration” does not imply that suchconfiguration is essential to the subject technology or that suchconfiguration applies to all configurations of the subject technology. Adisclosure relating to a configuration may apply to all configurations,or one or more configurations. A phrase such as a configuration mayrefer to one or more configurations and vice versa.

The word “exemplary” is used herein to mean “serving as an example orillustration.” Any aspect or design described herein as “exemplary” isnot necessarily to be construed as preferred or advantageous over otheraspects or designs.

What is claimed is:
 1. A computer-implemented method comprising:detecting, by a network device, a link failure between the networkdevice and a destination node, the link failure corresponding to a firstrespective physical link of the network device that corresponds to alogical link that combines respective physical links of the networkdevice and a different network device into a single port channel to thedestination node, wherein the network device and the different networkdevice comprise a single logical network device based on the logicallink and single port channel; receiving, by the network device, a datapacket addressed to the destination node; determining that a packetheader of the data packet includes an indication that the data packetexperienced a prior packet bounce; and based on the determining that thepacket header of the data packet includes the indication that the datapacket experienced the prior packet bounce, rerouting the data packet tothe destination node via a second respective physical link of thedifferent network device, wherein the second respective physical link ispart of the single port channel associated with the single logicalnetwork device.
 2. The computer-implemented method of claim 1, whereinrerouting the data packet includes updating encapsulation information ofthe data packet to include an address of the different network device.3. The computer-implemented method of claim 2, wherein the updating ofthe encapsulation information includes transmitting the data packet tothe different network device for forwarding to the destination node. 4.The computer-implemented method of claim 2, wherein the updating of theencapsulation information includes modifying an outer tunnel-end-point(TEP) destination address of the data packet.
 5. Thecomputer-implemented method of claim 1, wherein the indication is thatthe data packet was undeliverable by the destination node.
 6. Thecomputer-implemented method of claim 1, further comprising: based on adetermination that a second packet header of a second data packetreceived by the network device includes a second indication that thesecond data packet experienced a previous packet bounce, discarding thesecond data packet.
 7. The computer-implemented method of claim 1,wherein the network device is configured to retain an address of thedifferent network device and a shared address of the single portchannel.
 8. The computer-implemented method of claim 1, wherein at leastone of the network device or the different network device is connectedto a different destination node, and wherein a forwarding decision for adifferent data packet addressed to the different destination node ismade by at least one of the network device or the different networkdevice based on a hash function performed on address information of thedifferent data packet.
 9. A system comprising: one or more processors;and a computer-readable medium comprising instructions stored thereinthat, when executed by the one or more processors, cause the one or moreprocessors to perform operations comprising: detecting, by a networkdevice, a link failure between the network device and a destinationnode, the link failure corresponding to a first respective physical linkof the network device that corresponds to a logical link that combinesrespective physical links of the network device and a different networkdevice into a single port channel to the destination node, wherein thenetwork device and the different network device comprise a singlelogical network device based on the logical link and single portchannel; receiving, by the network device, a data packet addressed tothe destination node; determining that a packet header of the datapacket includes an indication that the data packet experienced a priorpacket bounce; and based on the determining that the packet header ofthe data packet includes the indication that the data packet experiencedthe prior packet bounce, rerouting the data packet to the destinationnode via a second respective physical link of the different networkdevice, wherein the second respective physical link is part of thesingle port channel associated with the single logical network device.10. The system of claim 9, wherein the indication is a flipped bit inpacket encapsulation information, and wherein the flipped bit isindicated via a bouncing switch.
 11. The system of claim 9, whereinrerouting the data packet includes modifying an outer tunnel-end-point(TEP) destination address of the data packet.
 12. The system of claim 9,wherein the indication is that the data packet was undeliverable by thedestination node.
 13. The system of claim 9, wherein the operationsfurther comprise: based on a determination that a second packet headerof a second data packet received by the network device includes a secondindication that the second data packet experienced a previous packetbounce, discarding the second data packet.
 14. The system of claim 9,wherein the operations further comprise storing an address of thedifferent network device and a shared address of the single portchannel.
 15. The system of claim 9, wherein the network device and thedifferent network device are connected to a different destination node,and wherein a forwarding decision for a different data packet addressedto the different destination node is made by at least one of the networkdevice or the different network device based on a hash functionperformed on address information of the different data packet.
 16. Anon-transitory computer-readable storage medium comprising instructionsstored therein, which when executed by one or more processors, cause theone or more processors to perform operations comprising: detecting, by anetwork device, a link failure between the network device and adestination node, the link failure corresponding to a first respectivephysical link of the network device that corresponds to a logical linkthat combines respective physical links of the network device and adifferent network device into a single port channel to the destinationnode, wherein the network device and the different network devicecomprise a single logical network device based on the logical link andsingle port channel; receiving, by the network device, a data packetaddressed to the destination node; determining that a packet header ofthe data packet includes an indication that the data packet experienceda prior packet bounce; and based on the determining that the packetheader of the data packet includes the indication that the data packetexperienced the prior packet bounce, rerouting the data packet to thedestination node via a second respective physical link of the differentnetwork device, wherein the second respective physical link is part ofthe single port channel associated with the single logical networkdevice.
 17. The non-transitory computer-readable storage medium of claim16, wherein rerouting the data packet includes updating encapsulationinformation of the data packet to include an address of the differentnetwork device.
 18. The non-transitory computer-readable storage mediumof claim 17, wherein updating of the encapsulation information includestransmitting the data packet to the different network device forforwarding to the destination node.
 19. The non-transitorycomputer-readable storage medium of claim 18, wherein the network deviceis configured to retain the address of the different network device anda shared address of a the single port channel.
 20. The non-transitorycomputer-readable storage medium of claim 16, wherein the indication isthat the data packet was undeliverable by the destination node.